3

An optimal lower bound on the number of variables for graph identification

Year:
1992
Language:
english
File:
PDF, 1.30 MB
english, 1992
6

Algorithms for coloring semi-random graphs

Year:
1998
Language:
english
File:
PDF, 373 KB
english, 1998
8

Data structures for distributed counting

Year:
1984
Language:
english
File:
PDF, 676 KB
english, 1984
9

The complexity of presburger arithmetic with bounded quantifier alternation depth

Year:
1982
Language:
english
File:
PDF, 683 KB
english, 1982
11

On the power of combinatorial and spectral invariants

Year:
2010
Language:
english
File:
PDF, 145 KB
english, 2010
12

Faster Integer Multiplication

Year:
2009
Language:
english
File:
PDF, 319 KB
english, 2009
13

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

Year:
2014
Language:
english
File:
PDF, 557 KB
english, 2014
19

PARALLEL EDGE COLORING APPROXIMATION

Year:
1996
Language:
english
File:
PDF, 506 KB
english, 1996
20

Approximately Counting Embeddings into Random Graphs

Year:
2014
Language:
english
File:
PDF, 946 KB
english, 2014
28

Efficient computation of the characteristic polynomial of a threshold graph

Year:
2016
Language:
english
File:
PDF, 514 KB
english, 2016
29

Space Saving by Dynamic Algebraization Based on Tree-Depth

Year:
2017
Language:
english
File:
PDF, 524 KB
english, 2017